Innnitary Lambda Calculus
نویسندگان
چکیده
In a previous paper we have established the theory of transsnite reduction for orthogonal term rewriting systems. In this paper we perform the same task for the lambda calculus. From the viewpoint of innnitary rewriting, the BB ohm model of the lambda calculus can be seen as an innnitary term model. In contrast to term rewriting, there are several diierent possible notions of innnite term, which give rise to diierent BB ohm-like models, which embody diierent notions of lazy or eager computation.
منابع مشابه
Infinitary Lambda Calculus Innnitary Lambda Calculus
In a previous paper we have established the theory of transsnite reduction for orthogonal term rewriting systems. In this paper we perform the same task for the lambda calculus. From the viewpoint of innnitary rewriting, the BB ohm model of the lambda calculus can be seen as an innnitary term model. In contrast to term rewriting, there are several diierent possible notions of innnite term, whic...
متن کاملIn nite - calculus and Types ? Alessandro
Recent work on innnitary versions of the lambda calculus has shown that the innnite lambda calculus can be a useful tool to study the unsolvable terms of the classical lambda calculus. Working in the framework of the intersection type disciplines, we devise a type assignment system such that two terms are equal in the innnite lambda calculus ii they can be assigned the same types in any basis. ...
متن کاملCyclic Lambda Calculi
We precisely characterize a class of cyclic lambda-graphs, and then give a sound and complete axiomatization of the terms that represent a given graph. The equational axiom system is an extension of lambda calculus with the letrec construct. In contrast to current theories , which impose restrictions on where the rewriting can take place, our theory is very liberal, e.g., it allows rewriting un...
متن کاملComputing with Innnitary Logic
Most recursive extensions of relational calculus converge around two central classes of queries: xpoint and while. Innnitary logic (with nitely many variables) is a very powerful extension of these languages which provides an elegant unifying formalism for a wide variety of query languages. However, neither the syntax nor the semantics of innnitary logic are eeective, and its connection to prac...
متن کاملA complete axiomatization forML!1
In this paper we present a completeness theorem for the innnitary modal logic ML !1. The proof is based on the new notion of an innnitary modal consistency property. 1
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996